An Improved ID-based Authenticated Group Key Agreement Scheme

نویسندگان

  • Xinjun Du
  • Ying Wang
  • Jianhua Ge
  • Yumin Wang
چکیده

Xinjun Du, Ying Wang, Jianhua Ge and Yumin Wang Key Laboratory of Computer Networks and Information Security Xidian University Xi’an 710071, P.R. China Abstract. Authenticated group key agreement problem is important in many modern collaborative and distributed applications. There are two ID-based authenticated group key agreement schemes have been proposed by Choi et al. and us, which are based on bilinear pairings and BD scheme. Recently, Zhang and Chen propose an impersonation attack on the two schemes, which means the schemes are not fully authenticated. In this paper, we propose an improved ID-based authenticated group key agreement scheme which can resist this attack.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Improving Choi et al.’s ID-based Authenticated Group Key Agreement Scheme at PKC2004

In modern network computing, authenticated group key agreement (AGKA) is important for conferencing. After Shamir [2] proposed the ID-based cryptosystem in 1984, the various applications on the ID-based cryptosystem have been actively studied, due to the simple key management complexity. For the AGKA, Choi et al. [16] proposed an ID-based authenticated group key agreement with bilinear maps, wh...

متن کامل

Attack on Two ID-based Authenticated Group Key Agreement Schemes

Authenticated group key agreement problem is important in many modern collaborative and distributed applications. Recently, there are two ID-based authenticated group key agreement schemes have been proposed, one is Choi et al.’s [2] scheme, the other is Du et al.’s [3] scheme. They are all constructed from bilinear pairings based on Burmester and Desmedt scheme [1]. In this paper, we propose a...

متن کامل

Improved ID-based Authenticated Group Key Agreement Secure Against Impersonation Attack by Insider

Many conference systems over the Internet require authenticated group key agreement (AGKA) for secure and reliable communication. After Shamir [1] proposed the ID-based cryptosystem in 1984, ID-based AGKA protocols have been actively studied because of the simple public key management. In 2006, Zhou et al. [12] proposed two-round ID-based AGKA protocol which is very efficient in communication a...

متن کامل

An Improved One-Round ID-Based Tripartite Authenticated Key Agreement Protocol

A tripartite authenticated key agreement protocol is generally designed to accommodate the need of three speci c entities in communicating over an open network with a shared secret key, which is used to preserve con dentiality and data integrity. Since Joux initiates the development of tripartite key agreement protocol, many prominent tripartite schemes have been proposed subsequently. In 2005,...

متن کامل

Cryptanalysis of Efficient Unlinkable Secret Handshakes for Anonymous Communications

Several unlinkable secret handshakes schemes have been proposed in recent years. As performing the successful secret handshakes is essentially equivalent to computing a common key between two interactive members of the same group. Therefore secret handshakes scheme is a key agreement protocol between two members of the same group. So it is necessary for a secret handshakes scheme to fulfill sec...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IACR Cryptology ePrint Archive

دوره 2003  شماره 

صفحات  -

تاریخ انتشار 2003